Irregular variable length coding

نویسنده

  • Robert G. Maunder
چکیده

FACULTY OF ENGINEERING, SCIENCE AND MATHEMATICS SCHOOL OF ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy Irregular Variable Length Coding by Robert G. Maunder In this thesis, we introduce Irregular Variable Length Coding (IrVLC) and investigate its applications, characteristics and performance in the context of digital multimedia broadcast telecommunications. During IrVLC encoding, the multimedia signal is represented using a sequence of concatenated binary codewords. These are selected from a codebook, comprising a number of codewords, which, in turn, comprise various numbers of bits. However, during IrVLC encoding, the multimedia signal is decomposed into particular fractions, each of which is represented using a different codebook. This is in contrast to regular Variable Length Coding (VLC), in which the entire multimedia signal is encoded using the same codebook. The application of IrVLCs to joint source and channel coding is investigated in the context of a video transmission scheme. Our novel video codec represents the video signal using tessellations of Variable-Dimension Vector Quantisation (VDVQ) tiles. These are selected from a codebook, comprising a number of tiles having various dimensions. The selected tessellation of VDVQ tiles is signalled using a corresponding sequence of concatenated codewords from a Variable Length Error Correction (VLEC) codebook. This VLEC codebook represents a specific joint source and channel coding case of VLCs, which facilitates both compression and error correction. However, during video encoding, only particular combinations of the VDVQ tiles will perfectly tessellate, owing to their various dimensions. As a result, only particular sub-sets of the VDVQ codebook and, hence, of the VLEC codebook may be employed to convey particular fractions of the video signal. Therefore, our novel video codec can be said to employ IrVLCs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irregular Variable Length Coding for Near-capacity Joint Source and Channel Coding

In this paper we propose a novel Irregular Variable Length Coding (IrVLC) scheme for near-capacity joint source and channel coding. We employ a number of component Variable Length Coding (VLC) codebooks having different coding rates for encoding particular fractions of the input source symbol stream. With the aid of EXtrinsic Information Transfer (EXIT) charts, these fractions may be chosen suc...

متن کامل

Iterative Source-Channel Decoding for Robust Image Transmission

In this paper we investigate iterative source-channel decoding for robust JPEG coded images transmission over noisy channels. Huffman codes used as the variable-length coding scheme in JPEG coding can be represented by an irregular trellis structure proposed by Balakirsky (1997). State transition probabilities can be derived from the irregular trellis and can be used as a priori information to ...

متن کامل

EXIT-Chart Aided 3-Stage Concatenated Ultra-WideBand Time-Hopping Spread-Spectrum Impulse Radio Design

A serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) scheme is amalgamated with a unity-rate precoded Time-Hopping (TH) Pulse Position Modulation (PPM) aided Ultra-Wide Bandwidth (UWB) SpreadSpectrum (SS) impulse radio design. The proposed design is capable of operating at low Signal-to-Noise Ratios (SNR) in Nakagami-m fading channels contaminated by Partial ...

متن کامل

LZAC Lossless Data Compression

This paper presents LZAC, a new universal lossless data compression algorithm derived from the popular and widely used LZ77 family. The objective of LZAC is to improve the compression ratios of the LZ77 family while still retaining the family’s key characteristics: simple, universal, fast in decoding, and economical in memory consumption. LZAC presents two new ideas: composite fixed-variable-le...

متن کامل

The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability

We consider the variable-to-fixed length lossy source coding (VFSC) problem. The optimal compression rate of the average length of variable-to-fixed source coding, allowing a non-vanishing probability of excess-distortion ε, is shown to be equal to (1−ε)R(D), where R(D) is the rate-distortion function of the source. In comparison to the related results of Koga and Yamamoto as well as Kostina, P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007